#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;

const int F=100007;

int a[F],b[F];

inline int read() {
	int X=0; 
	bool flag=1; 
	char ch=getchar();
	while(ch<'0'||ch>'9') {
		if(ch=='-') 
			flag=0; 
		ch=getchar();
	}
	while(ch>='0'&&ch<='9') 
		X=(X<<1)+(X<<3)+ch-'0',ch=getchar();
	if(flag)return X;
	return(X-1);
}

priority_queue<int,vector<int>,greater<int> > q;

int main() {
	int n=read();
	for(int i=1;i<=n;i++) {
		a[i]=read();
	}
	for(int i=1;i<=n;i++) {
		b[i]=read();
	}
	for(int i=1;i<=n;i++)
	    for(int j=1;(i-1)*(j-1)<=n&&j<=n;j++)
	    	q.push(a[i]+b[j]);
	while(n--)
        printf("%d ",q.top()),q.pop();
}